Ranks of propelinear perfect binary codes
نویسندگان
چکیده
It is proven that for any numbers n = 2 m − 1, m ≥ 4 and r, such that n − log(n + 1) ≤ r ≤ n excluding n = r = 63, n = 127, r ∈ {126, 127} and n = r = 2047 there exists a propelinear perfect binary code of length n and rank r.
منابع مشابه
On the Number of Nonequivalent Propelinear Extended Perfect Codes
The paper proves that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov (2007) are propelinear. All such codes have small rank, which is one more than the rank of the extended Hamming code of the same length. We investigate the ...
متن کاملOn binary 1-perfect additive codes: Some structural properties
The rank and kernel of 1-perfect additive codes is determined. Additive codes could be seen as translation-invariant propelinear codes and, in this correspondence, a characterization of propelinear codes as codes having a regular subgroup of the full group of isometries of the code is established. A characterization of the automorphism group of a 1-perfect additive code is given and also the ca...
متن کاملTranslation-invariant propelinear codes
A class of binary group codes is investigated. These codes are the propelinear codes, deened over the Hamming metric space F n , F = f0; 1g, with a group structure. Generally, they are neither abelian nor translation invariant codes but they have good algebraic and com-binatorial properties. Linear codes and Z 4-linear codes can be seen as a subclass of prope-linear codes. Exactly, it is shown ...
متن کاملPropelinear structure of Z_{2k}-linear codes
Let C be an additive subgroup of Z n 2k for any k ≥ 1. We define a Gray map Φ : Z n 2k −→ Z kn 2 such that Φ(C) is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, Φ is the unique Gray map such that Φ(C) is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.
متن کاملRelating propelinear and binary G-linear codes
In this paper we establish the connections between two di7erent extensions of Z4-linearity for binary Hamming spaces. We present both notions – propelinearity and G-linearity – in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1210.8253 شماره
صفحات -
تاریخ انتشار 2012